logoClassRank

Curtin University

Areas of Study

Theoretical Foundations of Computer Science 552

  • 302976
  • Semester 2
  • 25.0
Average Rating
Difficulty Level

Automata theory: deterministic and non-deterministic automata and conversions. Grammars: context free grammars, languages for grammars and Parse trees. Turing machines and abstractions of RAM. Decidability, reducibility P and PN classes. Time and spare complexity. NP completeness. -- Course Website



Post an anonymous review of this course

Overall experience
Difficulty Level
POST